A Reconfigurable Formation and Disjoint Hierarchical Routing for Rechargeable Bluetooth Networks
نویسندگان
چکیده
In this paper, a reconfigurable mesh-tree with a disjoint hierarchical routing protocol for the Bluetooth sensor network is proposed. First, a designated root constructs a tree-shaped subnet and propagates parameters k and c in its downstream direction to determine new roots. Each new root asks its upstream master to start a return connection to convert the first tree-shaped subnet into a mesh-shaped subnet. At the same time, each new root repeats the same procedure as the designated root to build its own tree-shaped subnet, until the whole scatternet is formed. As a result, the reconfigurable mesh-tree constructs a mesh-shaped topology in one densely covered area that is extended by tree-shaped topology to other sparsely covered areas. To locate the optimum k layer for various sizes of networks, a peak-search method is introduced in the designated root to determine the optimum mesh-tree configuration. In addition, the reconfigurable mesh-tree can dynamically compute the optimum layer k when the size of the network changes in the topology maintenance phase. In order to deliver packets over the mesh-tree networks, a disjoint hierarchical routing protocol is designed during the scatternet formation phase to efficiently forward packets in-between the mesh-subnet and the tree-subnet. To achieve the energy balance design, two equal disjoint paths are generated, allowing each node to alleviate network congestion, since most traffic occurs at the mesh-subnet. Simulation results show that the joint reconfigurable method and routing algorithm generate an efficient scatternet configuration by achieving better scatternet and routing performance than BlueHRT (bluetooth hybrid ring tree). Furthermore, the disjoint routing with rechargeable battery strategy effectively improves network lifetime and demonstrates better energy efficiency than conventional routing methods.
منابع مشابه
MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملReliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network
-----------------------------------------------------------------ABSTRACT----------------------------------------------------------------In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the oth...
متن کاملMulti-hop scatternet formation and routing for large scale Bluetooth networks
This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe an efficient method to build a Connected Dominating Set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets (Song et al., 2005) in each cluster. The final scatternet, M-dBBlue, guarantees the connectivity. Our experiment shows...
متن کاملMultihop Scatternet Formation and Routing for Large Scale Bluetooth Networks
This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe a novel communication efficient method to build a connected dominating set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets [1] in each cluster. Notice that our methods is not a simple combination of existing CDS methods an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016